Common ancestor type distribution: A Moran model and its deterministic limit
نویسندگان
چکیده
منابع مشابه
Common Ancestors in a Generalized Moran model
The Moran model is used in population genetics as a simple way to describe the stochastic evolution of a biological population. The model assumes that the population has a fixed size N and that it evolves through random reproduction events, in which one individual dies and is replaced by a newborn. Parents of the newborn individual are chosen at random from the population. In the classical Mora...
متن کاملThe common ancestor type distribution of a Λ-Wright-Fisher process with selection and mutation
Using graphical methods based on a ‘lookdown’ and pruned version of the ancestral selection graph, we obtain a representation of the type distribution of the ancestor in a two-type WrightFisher population with mutation and selection, conditional on the overall type frequency in the old population. This extends results from [15], now including the case of heavy-tailed offspring, directed by a re...
متن کاملThe common ancestor type distribution of a $\Lambda$-Wright-Fisher process with selection and mutation
Using graphical methods based on a ‘lookdown’ and pruned version of the ancestral selection graph, we obtain a representation of the type distribution of the ancestor in a two-type Wright-Fisher population with mutation and selection, conditional on the overall type frequency in the old population. This extends results from [17], now including the case of heavy-tailed offspring, directed by a r...
متن کاملLooking down in the ancestral selection graph: A probabilistic approach to the common ancestor type distribution.
In a (two-type) Wright-Fisher diffusion with directional selection and two-way mutation, let x denote today's frequency of the beneficial type, and given x, let h(x) be the probability that, among all individuals of today's population, the individual whose progeny will eventually take over in the population is of the beneficial type. Fearnhead (2002) and Taylor (2007) obtained a series represen...
متن کاملLowest Common Ancestor(LCA)
Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2017
ISSN: 0304-4149
DOI: 10.1016/j.spa.2016.06.019